Fast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform

نویسندگان

Moon Ho Lee

Yuri L. Borissov

چکیده

order Reed-Muller code guaranteeing correction of up to •un/4 sin(p-1/2 pƒÎ)•v errors and having complexity proportional to nlogn, where n=pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case. key words: p-ary first-order Reed-Muller codes, decoding algorithms, Jacket matrix

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Noise-Adaptive Algorithm for First-Order Reed-Muller Decoding

We consider the problem of decoding First-Order Reed-Muller codes efficiently. We give an algorithm that implicitly adapts to the noise conditions, runs significantly faster than known maximum-likelihood algorithms, and yields an error rate that is very close to optimal. When applied to CCK demodulation (used in the 802.11b standard for Wireless Local Area Networks), the algorithm runs up to 4 ...

متن کامل

Arikan and Alamouti matrices based on fast block-wise inverse jacket transform

Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to ...

متن کامل

List Decoding of q - ary Reed - Muller Codes 1 )

The q-ary Reed-Muller codes RMq(u,m) of length n = q are a generalization of Reed-Solomon codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the univariate case, randomized list-decoding algorithms for Reed-Muller codes were given in [1] and [15]. The algorithm in [15] is an improvement of the algorithm ...

متن کامل

Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes

In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based on the GMC decoding algorithm proposed by Schnabl and Bossert [1] which interprets Reed-Muller codes as generalized multiple concatenated codes. We extend the GMC algorithm to list-decoding (L-GMC). As a result, a SDML decoding algorithm for the first order Reed-Muller codes is obtained. Moreover...

متن کامل